Adaptive structuring of binary search trees using conditional rotations
نویسندگان
چکیده
منابع مشابه
Adaptive Structuring of Binary Search Trees Using Conditional Rotations
Consider a set A = {A1, A2,...,AN} of records, where each record is identified by a unique key. The records are accessed based on a set of access probabilities S = [s1,s2,...,sN] and are to be arranged lexicographically using a Binary Search Tree (BST). If S is known a priori, it is well known [10] that an optimal BST may be constructed using A and S. We consider the case when S is not known a ...
متن کاملSelf-organizing maps whose topologies can be learned with adaptive binary search trees using conditional rotations
Numerous variants of Self-Organizing Maps (SOMs) have been proposed in the literature, including those which also possess an underlying structure, and in some cases, this structure itself can be defined by the user Although the concepts of growing the SOM and updating it have been studied, the whole issue of using a self-organizing Adaptive Data Structure (ADS) to further enhance the properties...
متن کاملA Lower Bound Framework for Binary Search Trees with Rotations
This paper considers the problem of bounding below the cost of accessing a sequence of keys in a binary search tree. We develop a lower bound framework for this problem that applies to any binary search tree algorithm, including self-adjusting and offline ones. This new framework can be used to derive two previously known lower bounds. This research was sponsored by National Science Foundation ...
متن کاملUntangling Binary Trees via Rotations
In this paper we present a polynomial time algorithm for finding the shortest sequence of rotations that converts one binary tree into another when both binary trees are of a restricted form. The initial tree must be a degenerate tree, where every node has exactly one child, and the destination binary tree must also be degenerate, of a more restricted nature. Previous work on rotation distance ...
متن کاملEfficient Adaptive Data Compression Using Fano Binary Search Trees
In this paper, we show an effective way of using adaptive self-organizing data structures in enhancing compression schemes. We introduce a new data structure, the Partitioning Binary Search Tree (PBST), which is based on the well-known Binary Search Tree (BST), and when used in conjunction with Fano encoding, the PBST leads to the so-called Fano Binary Search Tree (FBST). The PBST and FBST can ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 1993
ISSN: 1041-4347
DOI: 10.1109/69.234780